Optimal Alphabetic Ternary Trees
نویسندگان
چکیده
We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.
منابع مشابه
Alphabetic Trees Theory and Applications in Layout Driven Logic Synthesis Revision of TCAD Manuscript
Routing plays an important role in determining the total circuit area and circuit performance and hence must be addressed as early as possible during the design process In this paper an e ective routing driven approach for technology dependent logic synthesis which relies on alphabetic tree construction is presented Alphabetic trees are trees which are generated under the restriction that the i...
متن کاملOptimum Alphabetic Binary Trees
We describe a modiication of the Hu{Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.
متن کاملLimiting The Search for 2-Dimensional Optimal Alphabetic Trees
Two-dimensional alphabetic trees have many applications in a wide variety of diverse fields. Although, a relatively fast algorithm that finds an approximate optimal alphabetic tree (OAT) does exist, yet, the only way to find the exact one is to use dynamic programming. In dynamic programming the (OAT) is found by simply examining all nodes in the two dimensional array of weights as possible roo...
متن کاملOptimal Alphabetic Trees
An algorithm of Knuth for finding an optimal binary tree is extended in several directions to solve related problems. The first case considered is restricting the depth of the tree by some predetermined integer K, and a Kn algorithm is given. Next, for trees of degree tr, rather than binary trees, Kn log tr and n log tr algorithms are found for the restricted and nonrestricted cases, respective...
متن کامل(note) Correctness of Constructing Optimal Alphabetic Trees Revisited
Several new observations which lead to new correctness proofs of two known algorithms (Hu-Tucker and Garsia-Wachs) for construction of optimal alphabetic trees are presented. A generalized version of the Garsia-Wachs algorithm is given. Proof of this generalized version works in a structured and illustrative way and clariies the usually poorly-understood behavior of both the Hu-Tucker and Garsi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1402.3036 شماره
صفحات -
تاریخ انتشار 2014